An application of the Lanczos Method
نویسنده
چکیده
1 2 , γ γ , can be mapped conveniently onto a matrix. The expectation value of the this operator <Ψ|H|Ψ > will lead to a corresponding eigenpair. We can map the gird of H using a simple finite difference equation, onto a vector whose elements are defined as, {Ψ00, Ψ10, ..., Ψn0, Ψn1, ..., Ψnn}. When the corresponding eigenvector is found, these elements are then mapped back onto their corresponding gird locations. Schematically, mapping Yang's potential onto H has the form of:
منابع مشابه
An effective method for eigen-problem solution of fluid-structure systems
Efficient mode shape extraction of fluid-structure systems is of particular interest in engineering. An efficient modified version of unsymmetric Lanczos method is proposed in this paper. The original unsymmetric Lanczos method was applied to general form of unsymmetric matrices, while the proposed method is developed particularly for the fluid-structure matrices. The method provides us with si...
متن کاملABLE: An Adaptive Block Lanczos Method for Non-Hermitian Eigenvalue Problems
This work presents an adaptive block Lanczos method for large-scale non-Hermitian Eigenvalue problems (henceforth the ABLE method). The ABLE method is a block version of the non-Hermitian Lanczos algorithm. There are three innovations. First, an adaptive blocksize scheme cures (near) breakdown and adapts the blocksize to the order of multiple or clustered eigenvalues. Second, stopping criteria ...
متن کاملHelmholtz beam propagation in rib waveguides and couplers by iterative Lanczos reduction
The solution of the Helmholtz equation requires the application of an exponentiated square root operator to an initial field. This operation is greatly facilitated by the introduction of a representation in which the abovementioned operator is diagonal. The Lanczos method permits this diagonalization to be performed in a lowdimensional space and the propagation to be carried out to arbitrary or...
متن کاملAn Implicitly Restarted Block Lanczos Bidiagonalization Method Using Leja Shifts
In this paper, we propose an implicitly restarted block Lanczos bidiagonalization (IRBLB) method for computing a few extreme or interior singular values and associated right and left singular vectors of a large matrix A. Our method combines the advantages of a block routine, implicit shifting, and the application of Leja points as shifts in the accelerating polynomial. The method neither requir...
متن کاملApplication of the Lanczos algorithm for solving the linear systems that occur in continuation problems
We study the Lanczos method for solving symmetric linear systems with multiple right-hand sides. First, we propose a numerical method of implementing the Lanczos method, which can provide all approximations to the solution vectors of the remaining linear systems. We also seek possible application of this algorithm for solving the linear systems that occur in continuation problems. Sample numeri...
متن کاملThe Lanczos method: evolution and application
A solution to get the problem off, have you found it? Really? What kind of solution do you resolve the problem? From what sources? Well, there are so many questions that we utter every day. No matter how you will get the solution, it will mean better. You can take the reference from some books. And the the lanczos method evolution and application is one book that we really recommend you to read...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006